Queue layouts of iterated line directed graphs
نویسندگان
چکیده
منابع مشابه
Stack and Queue Layouts of Directed Acyclic Graphs: Part II
Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack layout of a dag is similar to a stack layout of an undirected graph, with the additional requirement...
متن کاملStack and Queue Layouts of Directed Acyclic Graphs : Extended
Stack layouts and queue layouts of undirected graphs are used to model problems in fault tolerant computing, in VLSI design, and in managing the ow of data in a parallel processing system. In certain applications, such as managing the ow of data in a parallel processing system, it is more realistic to use layouts of directed acyclic graphs (dags) as a model. A stack layout of a dag consists of ...
متن کاملStack and Queue Layouts of Halin Graphs
A Halin graph the union of a tree with no degree-2 vertices and a cycle on the leaves of the tree. This paper examines the problem of laying out Halin graphs using stacks and queues. A k-stack (k-queue) layout of a graph consists of a linear ordering of the vertices along with an assignment of each edge to one of k stacks (queues). The ordering and the edge assignments must be made such that if...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملPlanarity of iterated line graphs
The line index of a graph G is the smallest k such that the kth iterated line graph of G is nonplanar. We show that the line index of a graph is either infinite or it is at most 4. Moreover, we give a full characterization of all graphs with respect to their line index. © 2007 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.04.045